________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        03.02.2010 19:56:11
Input Data from:  dataset102.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :100
# of Locations  :10
Ex.Facilities   :2
Total budget    :20000
Terror. attacks :1

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,154
Average f[i]   :4050
Average g[i,j] :1818,75
Total demand   :5640
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 25
> Selected Move:	2310	1	-1	8	4000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0    >new incumb.: 2310


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 28
> Selected Move:	2900	1	-1	5	9500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0    >new incumb.: 2900


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 31
> Selected Move:	3410	1	-1	4	13500


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  1  0    >new incumb.: 3410


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 30
> Selected Move:	3750	1	-1	9	19500


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  1  1    >new incumb.: 3750


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 21
> Selected Move:	3730	3	5	7	19500


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 22
> Selected Move:	3730	3	9	5	19000


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 19
> Selected Move:	3580	3	4	6	20000


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 20
> Selected Move:	3480	3	6	2	19000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 26
> Selected Move:	3500	3	7	9	19500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 26
> Selected Move:	3480	3	5	7	19500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 23
> Selected Move:	3410	3	7	4	18000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 25
> Selected Move:	3410	3	2	6	19000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 26
> Selected Move:	3410	3	9	5	18500


> New Y[]: 
	
	 2  3  0  0  1  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 26
> Selected Move:	3410	3	6	2	17500


> New Y[]: 
	
	 2  3  1  0  1  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 23
> Selected Move:	3410	3	2	3	20000


> New Y[]: 
	
	 2  3  0  1  1  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 26
> Selected Move:	3200	3	5	7	20000


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 29
> Selected Move:	3200	3	3	2	17500


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 24
> Selected Move:	3200	3	2	6	18500


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 21
> Selected Move:	3360	3	4	9	20500


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 17
> Selected Move:	3383	3	7	5	20500


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 20
> Selected Move:	3260	3	5	2	19000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 27
> Selected Move:	3260	3	9	5	18500


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 25
> Selected Move:	3260	2	2	-1	14500


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 29
> Selected Move:	3260	3	5	9	15000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 21
> Selected Move:	3410	3	6	4	14000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 26
> Selected Move:	3240	3	4	5	15500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 28
> Selected Move:	3220	3	9	7	15000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 30
> Selected Move:	3200	3	5	4	13500


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 27
> Selected Move:	3160	3	4	9	15500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 26
> Selected Move:	3175	1	-1	5	21000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 21
> Selected Move:	2730	3	8	4	21000


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 29
> Selected Move:	2920	3	7	2	19500


> New Y[]: 
	
	 2  3  1  0  1  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 32
> Selected Move:	2950	3	9	3	20000


> New Y[]: 
	
	 2  3  1  1  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 33
> Selected Move:	3160	3	4	8	20000


> New Y[]: 
	
	 2  3  1  1  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 28
> Selected Move:	3160	2	3	-1	13500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 27
> Selected Move:	3160	3	5	9	14000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 29
> Selected Move:	2985	1	-1	3	20500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 23
> Selected Move:	3238	3	2	4	20500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 25
> Selected Move:	2950	2	8	-1	16500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 37
> Selected Move:	2950	3	9	5	16000


> New Y[]: 
	
	 2  3  0  1  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 36
> Selected Move:	2900	3	4	8	16000


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 31
> Selected Move:	2935	1	-1	6	21000


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 42 #######################


> Neighbours evaluated; 25
> Selected Move:	2880	3	5	4	19500


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 43 #######################


> Neighbours evaluated; 30
> Selected Move:	2880	3	3	2	17000


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 44 #######################


> Neighbours evaluated; 26
> Selected Move:	3050	3	4	7	18500


> New Y[]: 
	
	 2  3  1  0  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 45 #######################


> Neighbours evaluated; 25
> Selected Move:	3050	2	2	-1	14500


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 46 #######################


> Neighbours evaluated; 29
> Selected Move:	2950	3	6	2	13500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 47 #######################


> Neighbours evaluated; 26
> Selected Move:	2950	1	-1	3	20000


> New Y[]: 
	
	 2  3  1  1  0  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 48 #######################


> Neighbours evaluated; 28
> Selected Move:	2880	3	7	4	18500


> New Y[]: 
	
	 2  3  1  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 49 #######################


> Neighbours evaluated; 25
> Selected Move:	2880	2	2	-1	14500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 50 #######################


> Neighbours evaluated; 28
> Selected Move:	2880	3	3	2	12000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 51 #######################


> Neighbours evaluated; 25
> Selected Move:	2880	3	2	6	13000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 52 #######################


> Neighbours evaluated; 25
> Selected Move:	2880	2	6	-1	8000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 53 #######################


> Neighbours evaluated; 25
> Selected Move:	2840	3	4	9	10000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 54 #######################


> Neighbours evaluated; 27
> Selected Move:	2840	1	-1	3	16500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 55 #######################


> Neighbours evaluated; 29
> Selected Move:	2878	1	-1	6	21500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 56 #######################


> Neighbours evaluated; 23
> Selected Move:	2800	3	9	7	21000


> New Y[]: 
	
	 2  3  0  1  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 57 #######################


> Neighbours evaluated; 26
> Selected Move:	2853	3	6	5	21500


> New Y[]: 
	
	 2  3  0  1  0  1  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 58 #######################


> Neighbours evaluated; 25
> Selected Move:	2910	3	8	4	21500


> New Y[]: 
	
	 2  3  0  1  1  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 59 #######################


> Neighbours evaluated; 29
> Selected Move:	2900	3	3	2	19000


> New Y[]: 
	
	 2  3  1  0  1  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 60 #######################


> Neighbours evaluated; 29
> Selected Move:	3040	1	-1	8	23000


> New Y[]: 
	
	 2  3  1  0  1  1  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 61 #######################


> Neighbours evaluated; 17
> Selected Move:	2970	4	1	5	19500


> New Y[]: 
	
	 2  0  1  0  1  3  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 62 #######################


> Neighbours evaluated; 24
> Selected Move:	2990	3	7	9	20000


> New Y[]: 
	
	 2  0  1  0  1  3  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 63 #######################


> Neighbours evaluated; 26
> Selected Move:	2990	4	5	9	19200


> New Y[]: 
	
	 2  0  1  0  1  1  0  0  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 64 #######################


> Neighbours evaluated; 24
> Selected Move:	3135	3	2	7	20700


> New Y[]: 
	
	 2  0  0  0  1  1  0  1  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 65 #######################


> Neighbours evaluated; 25
> Selected Move:	2990	2	7	-1	15200


> New Y[]: 
	
	 2  0  0  0  1  1  0  0  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 66 #######################


> Neighbours evaluated; 26
> Selected Move:	2990	4	9	4	17800


> New Y[]: 
	
	 2  0  0  0  3  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 67 #######################


> Neighbours evaluated; 27
> Selected Move:	2990	4	4	5	16000


> New Y[]: 
	
	 2  0  0  0  1  3  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 68 #######################


> Neighbours evaluated; 25
> Selected Move:	2990	4	5	8	17500


> New Y[]: 
	
	 2  0  0  0  1  1  0  0  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 69 #######################


> Neighbours evaluated; 31
> Selected Move:	2970	3	9	7	17000


> New Y[]: 
	
	 2  0  0  0  1  1  0  1  3  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 70 #######################


> Neighbours evaluated; 24
> Selected Move:	2970	4	8	4	17300


> New Y[]: 
	
	 2  0  0  0  3  1  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 71 #######################


> Neighbours evaluated; 23
> Selected Move:	2970	4	4	5	15500


> New Y[]: 
	
	 2  0  0  0  1  3  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 72 #######################


> Neighbours evaluated; 21
> Selected Move:	2970	4	5	7	15300


> New Y[]: 
	
	 2  0  0  0  1  1  0  3  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 73 #######################


> Neighbours evaluated; 25
> Selected Move:	3018	1	-1	9	21300


> New Y[]: 
	
	 2  0  0  0  1  1  0  3  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 74 #######################


> Neighbours evaluated; 24
> Selected Move:	2980	4	7	5	21500


> New Y[]: 
	
	 2  0  0  0  1  3  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 75 #######################


> Neighbours evaluated; 22
> Selected Move:	2863	3	9	6	20500


> New Y[]: 
	
	 2  0  0  0  1  3  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 76 #######################


> Neighbours evaluated; 21
> Selected Move:	2907	4	5	7	20300


> New Y[]: 
	
	 2  0  0  0  1  1  1  3  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 77 #######################


> Neighbours evaluated; 21
> Selected Move:	2970	3	6	2	19300


> New Y[]: 
	
	 2  0  1  0  1  1  0  3  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 78 #######################


> Neighbours evaluated; 21
> Selected Move:	2870	4	7	2	20500


> New Y[]: 
	
	 2  0  3  0  1  1  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 79 #######################


> Neighbours evaluated; 22
> Selected Move:	2847	3	2	3	20600


> New Y[]: 
	
	 2  0  0  3  1  1  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 80 #######################


> Neighbours evaluated; 27
> Selected Move:	2802	3	3	6	20800


> New Y[]: 
	
	 2  0  0  0  1  1  3  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 81 #######################


> Neighbours evaluated; 20
> Selected Move:	2760	2	4	-1	16800


> New Y[]: 
	
	 2  0  0  0  0  1  3  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 82 #######################


> Neighbours evaluated; 24
> Selected Move:	2780	3	7	9	17300


> New Y[]: 
	
	 2  0  0  0  0  1  3  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 83 #######################


> Neighbours evaluated; 27
> Selected Move:	2780	4	6	5	17000


> New Y[]: 
	
	 2  0  0  0  0  3  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 84 #######################


> Neighbours evaluated; 27
> Selected Move:	2780	4	5	8	18500


> New Y[]: 
	
	 2  0  0  0  0  1  1  0  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 85 #######################


> Neighbours evaluated; 27
> Selected Move:	2780	4	8	9	16200


> New Y[]: 
	
	 2  0  0  0  0  1  1  0  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 86 #######################


> Neighbours evaluated; 29
> Selected Move:	2944	1	-1	4	20200


> New Y[]: 
	
	 2  0  0  0  1  1  1  0  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 87 #######################


> Neighbours evaluated; 25
> Selected Move:	2765	4	9	5	21000


> New Y[]: 
	
	 2  0  0  0  1  3  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 88 #######################


> Neighbours evaluated; 22
> Selected Move:	2691	4	5	6	21300


> New Y[]: 
	
	 2  0  0  0  1  1  3  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 89 #######################


> Neighbours evaluated; 23
> Selected Move:	2755	3	6	2	21000


> New Y[]: 
	
	 2  0  3  0  1  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 90 #######################


> Neighbours evaluated; 21
> Selected Move:	2726	3	2	3	21100


> New Y[]: 
	
	 2  0  0  3  1  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 91 #######################


> Neighbours evaluated; 24
> Selected Move:	2650	3	9	2	19100


> New Y[]: 
	
	 2  0  1  3  1  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 92 #######################


> Neighbours evaluated; 26
> Selected Move:	2650	3	3	6	19300


> New Y[]: 
	
	 2  0  1  0  1  1  3  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 93 #######################


> Neighbours evaluated; 19
> Selected Move:	2650	4	6	2	20000


> New Y[]: 
	
	 2  0  3  0  1  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 94 #######################


> Neighbours evaluated; 19
> Selected Move:	2650	4	2	5	19000


> New Y[]: 
	
	 2  0  1  0  1  3  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 95 #######################


> Neighbours evaluated; 19
> Selected Move:	2650	2	2	-1	15000


> New Y[]: 
	
	 2  0  0  0  1  3  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 96 #######################


> Neighbours evaluated; 21
> Selected Move:	2760	3	4	7	16500


> New Y[]: 
	
	 2  0  0  0  0  3  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 97 #######################


> Neighbours evaluated; 21
> Selected Move:	2760	4	5	7	16300


> New Y[]: 
	
	 2  0  0  0  0  1  1  3  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 98 #######################


> Neighbours evaluated; 20
> Selected Move:	2760	4	7	8	18000


> New Y[]: 
	
	 2  0  0  0  0  1  1  1  3  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 99 #######################


> Neighbours evaluated; 24
> Selected Move:	2750	3	8	1	16000


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 100 #######################


> Neighbours evaluated; 34
> Selected Move:	2900	1	-1	4	20000


> New Y[]: 
	
	 2  3  0  0  1  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 101 #######################


> Neighbours evaluated; 29
> Selected Move:	2798	3	7	9	20500


> New Y[]: 
	
	 2  3  0  0  1  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 102 #######################


> Neighbours evaluated; 30
> Selected Move:	2810	3	6	3	22000


> New Y[]: 
	
	 2  3  0  1  1  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 103 #######################


> Neighbours evaluated; 24
> Selected Move:	2833	3	5	2	20500


> New Y[]: 
	
	 2  3  1  1  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 104 #######################


> Neighbours evaluated; 28
> Selected Move:	2900	3	3	7	19500


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 105 #######################


> Neighbours evaluated; 31
> Selected Move:	2943	1	-1	8	23500


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 106 #######################


> Neighbours evaluated; 15
> Selected Move:	2980	3	7	5	23500


> New Y[]: 
	
	 2  3  1  0  1  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 107 #######################


> Neighbours evaluated; 14
> Selected Move:	2945	3	2	7	25000


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 108 #######################


> Neighbours evaluated; 12
> Selected Move:	2926	4	0	9	20800


> New Y[]: 
	
	 0  3  0  0  1  1  0  1  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,235

## ITERATION 109 #######################


> Neighbours evaluated; 20
> Selected Move:	2920	3	7	2	19300


> New Y[]: 
	
	 0  3  1  0  1  1  0  0  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,24

## ITERATION 110 #######################


> Neighbours evaluated; 17
> Selected Move:	2920	4	9	5	19600


> New Y[]: 
	
	 0  3  1  0  1  2  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,245

## ITERATION 111 #######################


> Neighbours evaluated; 20
> Selected Move:	2900	3	9	7	19100


> New Y[]: 
	
	 0  3  1  0  1  2  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,25

## ITERATION 112 #######################


> Neighbours evaluated; 9
> Selected Move:	2900	4	5	7	19100


> New Y[]: 
	
	 0  3  1  0  1  1  0  2  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,255

## ITERATION 113 #######################


> Neighbours evaluated; 12
> Selected Move:	2875	3	2	6	20100


> New Y[]: 
	
	 0  3  0  0  1  1  1  2  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,26

## ITERATION 114 #######################


> Neighbours evaluated; 8
> Selected Move:	2874	4	7	5	20100


> New Y[]: 
	
	 0  3  0  0  1  2  1  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,265

## ITERATION 115 #######################


> Neighbours evaluated; 9
> Selected Move:	2819	3	6	9	21100


> New Y[]: 
	
	 0  3  0  0  1  2  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,27

## ITERATION 116 #######################


> Neighbours evaluated; 16
> Selected Move:	2813	4	5	7	21100


> New Y[]: 
	
	 0  3  0  0  1  1  0  2  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,275

## ITERATION 117 #######################


> Neighbours evaluated; 19
> Selected Move:	2770	2	9	-1	15100


> New Y[]: 
	
	 0  3  0  0  1  1  0  2  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,28

## ITERATION 118 #######################


> Neighbours evaluated; 10
> Selected Move:	2790	3	7	9	15300


> New Y[]: 
	
	 0  3  0  0  1  1  0  0  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,275

## ITERATION 119 #######################


> Neighbours evaluated; 22
> Selected Move:	2838	1	-1	6	20300


> New Y[]: 
	
	 0  3  0  0  1  1  1  0  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,28

## ITERATION 120 #######################


> Neighbours evaluated; 17
> Selected Move:	2770	2	4	-1	16300


> New Y[]: 
	
	 0  3  0  0  0  1  1  0  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,285

## ITERATION 121 #######################


> Neighbours evaluated; 17
> Selected Move:	2770	4	9	5	16600


> New Y[]: 
	
	 0  3  0  0  0  2  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,29

## ITERATION 122 #######################


> Neighbours evaluated; 18
> Selected Move:	2790	3	6	4	15600


> New Y[]: 
	
	 0  3  0  0  1  2  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,295

## ITERATION 123 #######################


> Neighbours evaluated; 19
> Selected Move:	2790	4	5	4	17500


> New Y[]: 
	
	 0  3  0  0  2  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,29

## ITERATION 124 #######################


> Neighbours evaluated; 19
> Selected Move:	2790	4	4	8	17100


> New Y[]: 
	
	 0  3  0  0  1  1  0  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,285

## ITERATION 125 #######################


> Neighbours evaluated; 24
> Selected Move:	2790	3	8	0	15500


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 126 #######################


> Neighbours evaluated; 28
> Selected Move:	2780	3	4	3	18000


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 127 #######################


> Neighbours evaluated; 33
> Selected Move:	2800	3	5	6	17500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 128 #######################


> Neighbours evaluated; 35
> Selected Move:	2800	3	9	5	17000


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 129 #######################


> Neighbours evaluated; 33
> Selected Move:	2770	3	3	9	16500


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 130 #######################


> Neighbours evaluated; 29
> Selected Move:	2770	3	0	8	18100


> New Y[]: 
	
	 0  3  0  0  0  1  1  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,255

## ITERATION 131 #######################


> Neighbours evaluated; 14
> Selected Move:	2770	4	8	6	17100


> New Y[]: 
	
	 0  3  0  0  0  1  2  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,25

## ITERATION 132 #######################


> Neighbours evaluated; 22
> Selected Move:	2750	3	9	7	16600


> New Y[]: 
	
	 0  3  0  0  0  1  2  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,245

## ITERATION 133 #######################


> Neighbours evaluated; 11
> Selected Move:	2770	3	6	4	17000


> New Y[]: 
	
	 0  3  0  0  2  1  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,24

## ITERATION 134 #######################


> Neighbours evaluated; 9
> Selected Move:	2770	4	4	5	15100


> New Y[]: 
	
	 0  3  0  0  1  2  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,235

## ITERATION 135 #######################


> Neighbours evaluated; 9
> Selected Move:	2770	4	5	8	16600


> New Y[]: 
	
	 0  3  0  0  1  1  0  1  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,23

## ITERATION 136 #######################


> Neighbours evaluated; 14
> Selected Move:	2770	3	8	0	15000


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 137 #######################


> Neighbours evaluated; 27
> Selected Move:	2770	3	5	9	15500


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 138 #######################


> Neighbours evaluated; 31
> Selected Move:	2830	1	-1	3	22000


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 139 #######################


> Neighbours evaluated; 25
> Selected Move:	2793	3	3	6	20500


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 140 #######################


> Neighbours evaluated; 29
> Selected Move:	2785	1	-1	8	24500


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 141 #######################


> Neighbours evaluated; 19
> Selected Move:	2910	3	9	5	24000


> New Y[]: 
	
	 2  3  0  0  1  1  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 142 #######################


> Neighbours evaluated; 16
> Selected Move:	2910	3	7	2	22500


> New Y[]: 
	
	 2  3  1  0  1  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 143 #######################


> Neighbours evaluated; 20
> Selected Move:	2828	3	2	9	24500


> New Y[]: 
	
	 2  3  0  0  1  1  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 144 #######################


> Neighbours evaluated; 12
> Selected Move:	2794	4	0	5	20600


> New Y[]: 
	
	 0  3  0  0  1  2  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,215

## ITERATION 145 #######################


> Neighbours evaluated; 13
> Selected Move:	2684	4	5	6	21100


> New Y[]: 
	
	 0  3  0  0  1  1  2  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,22

## ITERATION 146 #######################


> Neighbours evaluated; 15
> Selected Move:	2768	3	9	7	20600


> New Y[]: 
	
	 0  3  0  0  1  1  2  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,225

## ITERATION 147 #######################


> Neighbours evaluated; 9
> Selected Move:	2723	3	6	3	21100


> New Y[]: 
	
	 0  3  0  2  1  1  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 148 #######################


> Neighbours evaluated; 20
> Selected Move:	2650	3	7	2	19600


> New Y[]: 
	
	 0  3  1  2  1  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 149 #######################


> Neighbours evaluated; 19
> Selected Move:	2650	2	2	-1	15600


> New Y[]: 
	
	 0  3  0  2  1  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 150 #######################


> Neighbours evaluated; 18
> Selected Move:	2650	4	3	4	18000


> New Y[]: 
	
	 0  3  0  1  2  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 151 #######################


> Neighbours evaluated; 15
> Selected Move:	2650	4	4	5	16100


> New Y[]: 
	
	 0  3  0  1  1  2  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 152 #######################


> Neighbours evaluated; 18
> Selected Move:	2650	4	5	8	17600


> New Y[]: 
	
	 0  3  0  1  1  1  0  0  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 153 #######################


> Neighbours evaluated; 18
> Selected Move:	2580	3	3	2	15100


> New Y[]: 
	
	 0  3  1  0  1  1  0  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,25

## ITERATION 154 #######################


> Neighbours evaluated; 11
> Selected Move:	2750	1	-1	7	20600


> New Y[]: 
	
	 0  3  1  0  1  1  0  1  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,245

## ITERATION 155 #######################


> Neighbours evaluated; 10
> Selected Move:	2655	4	8	4	21000


> New Y[]: 
	
	 0  3  1  0  2  1  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,24

## ITERATION 156 #######################


> Neighbours evaluated; 8
> Selected Move:	2768	3	4	9	20800


> New Y[]: 
	
	 0  3  1  0  0  1  0  1  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 157 #######################


> Neighbours evaluated; 19
> Selected Move:	2702	4	9	5	21100


> New Y[]: 
	
	 0  3  1  0  0  2  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 158 #######################


> Neighbours evaluated; 15
> Selected Move:	2727	3	9	6	20100


> New Y[]: 
	
	 0  3  1  0  0  2  1  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,235

## ITERATION 159 #######################


> Neighbours evaluated; 9
> Selected Move:	2750	2	2	-1	16100


> New Y[]: 
	
	 0  3  0  0  0  2  1  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,24

## ITERATION 160 #######################


> Neighbours evaluated; 10
> Selected Move:	2750	4	5	7	16100


> New Y[]: 
	
	 0  3  0  0  0  1  1  2  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,245

## ITERATION 161 #######################


> Neighbours evaluated; 10
> Selected Move:	2750	4	7	8	17600


> New Y[]: 
	
	 0  3  0  0  0  1  1  1  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,25

## ITERATION 162 #######################


> Neighbours evaluated; 16
> Selected Move:	2620	3	6	2	16600


> New Y[]: 
	
	 0  3  1  0  0  1  0  1  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 163 #######################


> Neighbours evaluated; 13
> Selected Move:	2650	3	8	0	15000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 164 #######################


> Neighbours evaluated; 32
> Selected Move:	2760	3	2	3	17500


> New Y[]: 
	
	 2  3  0  1  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 165 #######################


> Neighbours evaluated; 30
> Selected Move:	2760	3	5	9	18000


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 166 #######################


> Neighbours evaluated; 32
> Selected Move:	2750	3	3	6	16500


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 167 #######################


> Neighbours evaluated; 30
> Selected Move:	2650	3	6	2	15500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 168 #######################


> Neighbours evaluated; 31
> Selected Move:	2750	1	-1	5	21000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 169 #######################


> Neighbours evaluated; 29
> Selected Move:	2750	3	9	6	20000


> New Y[]: 
	
	 2  3  1  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 170 #######################


> Neighbours evaluated; 29
> Selected Move:	2675	3	6	3	21500


> New Y[]: 
	
	 2  3  1  1  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 171 #######################


> Neighbours evaluated; 27
> Selected Move:	2740	3	5	4	20000


> New Y[]: 
	
	 2  3  1  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 172 #######################


> Neighbours evaluated; 27
> Selected Move:	2740	2	2	-1	16000


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 173 #######################


> Neighbours evaluated; 27
> Selected Move:	2630	3	4	8	16000


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 174 #######################


> Neighbours evaluated; 25
> Selected Move:	2740	1	-1	9	22000


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 175 #######################


> Neighbours evaluated; 21
> Selected Move:	2830	3	7	5	22000


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 176 #######################


> Neighbours evaluated; 22
> Selected Move:	2640	3	8	2	22000


> New Y[]: 
	
	 2  3  1  1  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 177 #######################


> Neighbours evaluated; 25
> Selected Move:	2700	2	5	-1	16500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 178 #######################


> Neighbours evaluated; 30
> Selected Move:	2700	3	9	5	16000


> New Y[]: 
	
	 2  3  1  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 179 #######################


> Neighbours evaluated; 28
> Selected Move:	2670	3	3	9	15500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 180 #######################


> Neighbours evaluated; 26
> Selected Move:	2670	1	-1	6	20500


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 181 #######################


> Neighbours evaluated; 29
> Selected Move:	2723	1	-1	8	24500


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 182 #######################


> Neighbours evaluated; 17
> Selected Move:	2820	3	6	7	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 183 #######################


> Neighbours evaluated; 14
> Selected Move:	2817	4	1	9	20700


> New Y[]: 
	
	 2  0  1  0  0  1  0  1  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 184 #######################


> Neighbours evaluated; 25
> Selected Move:	2743	3	2	6	21700


> New Y[]: 
	
	 2  0  0  0  0  1  1  1  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 185 #######################


> Neighbours evaluated; 23
> Selected Move:	2737	3	7	2	20200


> New Y[]: 
	
	 2  0  1  0  0  1  1  0  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 186 #######################


> Neighbours evaluated; 24
> Selected Move:	2694	3	9	7	20300


> New Y[]: 
	
	 2  0  1  0  0  1  1  3  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 187 #######################


> Neighbours evaluated; 21
> Selected Move:	2668	3	6	9	21300


> New Y[]: 
	
	 2  0  1  0  0  1  0  3  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 188 #######################


> Neighbours evaluated; 23
> Selected Move:	2680	3	5	4	19800


> New Y[]: 
	
	 2  0  1  0  1  0  0  3  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 189 #######################


> Neighbours evaluated; 24
> Selected Move:	2680	4	7	9	19200


> New Y[]: 
	
	 2  0  1  0  1  0  0  1  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 190 #######################


> Neighbours evaluated; 24
> Selected Move:	2680	2	2	-1	15200


> New Y[]: 
	
	 2  0  0  0  1  0  0  1  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 191 #######################


> Neighbours evaluated; 25
> Selected Move:	2680	4	9	4	17800


> New Y[]: 
	
	 2  0  0  0  3  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 192 #######################


> Neighbours evaluated; 26
> Selected Move:	2680	4	4	7	15800


> New Y[]: 
	
	 2  0  0  0  1  0  0  3  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 193 #######################


> Neighbours evaluated; 23
> Selected Move:	2680	4	7	8	17500


> New Y[]: 
	
	 2  0  0  0  1  0  0  1  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 194 #######################


> Neighbours evaluated; 27
> Selected Move:	2560	3	4	5	19000


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 195 #######################


> Neighbours evaluated; 26
> Selected Move:	2640	3	7	2	17500


> New Y[]: 
	
	 2  0  1  0  0  1  0  0  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 196 #######################


> Neighbours evaluated; 27
> Selected Move:	2650	3	9	4	15500


> New Y[]: 
	
	 2  0  1  0  1  1  0  0  3  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 197 #######################


> Neighbours evaluated; 24
> Selected Move:	2735	1	-1	7	21000


> New Y[]: 
	
	 2  0  1  0  1  1  0  1  3  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 198 #######################


> Neighbours evaluated; 20
> Selected Move:	2671	4	8	4	21300


> New Y[]: 
	
	 2  0  1  0  3  1  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 199 #######################


> Neighbours evaluated; 20
> Selected Move:	2650	2	7	-1	15800


> New Y[]: 
	
	 2  0  1  0  3  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 200 #######################


> Neighbours evaluated; 21
> Selected Move:	2650	4	4	2	15000


> New Y[]: 
	
	 2  0  3  0  1  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 201 #######################


> Neighbours evaluated; 18
> Selected Move:	2650	4	2	5	14000


> New Y[]: 
	
	 2  0  1  0  1  3  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 202 #######################


> Neighbours evaluated; 20
> Selected Move:	2650	3	2	3	16500


> New Y[]: 
	
	 2  0  0  1  1  3  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 203 #######################


> Neighbours evaluated; 26
> Selected Move:	2650	4	5	3	15100


> New Y[]: 
	
	 2  0  0  3  1  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,2
________________________________________________________________

Best solution found: 3750
Run Termination time: 03.02.2010 19:56:37
Run duration: 00:00:25.9062500
________________________________________________________________
